Effective Grushko Decompositions
نویسنده
چکیده
We show how to find a Grushko decomposition of a finitely presented group, given a solution to its word problem.
منابع مشابه
Reducing Linear Programs into Min-max Problems
We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of [1].
متن کاملInfinite-dimensional versions of the primary, cyclic and Jordan decompositions
The famous primary and cyclic decomposition theorems along with the tightly related rational and Jordan canonical forms are extended to linear spaces of infinite dimensions with counterexamples showing the scope of extensions.
متن کاملSubgroup theorem for valuated groups and the CSA property
A valuated group with normal forms is a group with an integer-valued length function satisfying some Lyndon’s axioms [Lyn63] and an additional axiom considered by Hurley [Hur80]. We prove a subgroup theorem for valuated groups with normal forms analogous to Grushko-Neumann’s theorem. We study also the CSA property in such groups.
متن کاملSpatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows
This paper studies the use of decomposition techniques to quickly find high-quality solutions to large-scale vehicle routing problems with time windows. It considers an adaptive decomposition scheme which iteratively decouples a routing problem based on the current solution. Earlier work considered vehiclebased decompositions that partitions the vehicles across the subproblems. The subproblems ...
متن کاملEffective JSJ Decompositions
In this paper we describe an elimination process which is a deterministic rewriting procedure that on each elementary step transforms one system of equations over free groups into a finitely many new ones. Infinite branches of this process correspond to cyclic splittings of the coordinate group of the initial system of equations. This allows us to construct algorithmically Grushko’s decompositi...
متن کامل